A new characterization of digital lines by least square fits

Melter, R.A., I. Stojmenovii and J. Zuni6, A new characterization of digital lines by least square fits, Pattern Recognition Letters 14 (1993) 83 88. In this paper we prove that digital line segments and their least square line fits are in one-to-one correspondence and give a new simple representation (xr,n,bo,br) of a digital line segment, where x, and n are the x-coordinate of the left endpoint and the number of digital points, respectively, while bo and b, are the coefficients of the least square line fit X=Do+Dr X for the given digital line segment. An O(z log n) time algorithm for obtaining a digital line segment from its least square line fit is described.